Automata for the verification of monadic second-order graph properties

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automata for the verification of monadic second-order graph properties

Article history: Received 20 July 2011 Accepted 25 July 2011 Available online 27 July 2012

متن کامل

Verifying monadic second order graph properties with tree automata

We address the concrete problem of verifying graph properties expressed in Monadic Second Order (MSO) logic. It is well-known that the model-checking problem for MSO logic on graphs is fixed-parameter tractable (FPT) [Cou09, Chap 6] with respect to tree-width and cliquewidth. The proof uses tree-decompositions (for tree-width as parameter) and clique-decompositions (for clique-width as paramete...

متن کامل

Graph-Query Verification using Monadic Second-Order Logic

This paper presents a static verification algorithm for a core subset of UnCAL, the query algebra for graph-structured databases proposed by Bunemann et al. Given a query and input/output schemas, our algorithm statically verifies that any graph satisfying the input schema is converted by the query to a graph satisfying the output schema. The basic idea is to reformulate the semantics of UnCAL ...

متن کامل

Automata for Monadic Second-Order Model-Checking

We describe the construction of finite automata on terms establishing that the model-checking problem for every monadic second-order graph property is fixed-parameter linear for tree-width and clique-width (Chapter 6 of [6]). In this approach, input graphs of small tree-width and clique-width are denoted by terms over finite signatures. These terms reflect the corresponding hierarchical decompo...

متن کامل

Monadic Second-order Logic for Parameterized Verification

Much work in automatic verification considers families of similar finite-state systems. But an often overlooked property is that sometimes a single finite-state system can be used to describe a parameterized, infinite family of systems. Thus verification of unbounded state spaces can take place by reduction to finite ones. The purpose of this article is to introduce Monadic Second-order Logic a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Logic

سال: 2012

ISSN: 1570-8683

DOI: 10.1016/j.jal.2011.07.001